Project 7 - Due Tue Oct 29 at 23:00

Reading

1. Slides and notebooks from the Lists and Memory Diagrams lecture and the Nested Loops lecture.
2. Problems and solutions from Lab 7 (Lists and Memory Diagrams) and Lab 8 (Nested Loops).
3. Think Python, Chapter 7 covers iteration, and Think Python, Chapter 10 covers lists.

---

Tasks

The instructions for each task:

• Task 1: List Diagrams — Create list structures whose memory diagrams match those depicted in given diagrams. For this task, having a partner is optional but recommended.

• Task 2: Train Inventory — Use nested loops to write functions for dealing with inventory on a train. You may complete EITHER this task or the wordSearch task, but you don't have to complete both. For this task, having a partner is optional but recommended.

• Task 3: Word Search — Use nested loops to solve word search puzzles. You may complete EITHER this task or the trainInventory task, but you don't have to complete both. For this task, having a partner is optional but recommended.

---

About this Project

These tasks will give you practice with memory diagrams and nested loops.

You must complete the listDiagrams task, and then you may choose either the trainInventory or wordSearch tasks, both of which cover nested loops in different ways. wordSearch is probably slightly harder than trainInventory overall, so we recommend it if you're planning to go straight on to CS 230 after CS 111.

If you want to find a partner to work with for this project, use this Google Sheet to do so.

Reminders

• Remember to download the starter code for each task from the Potluck server.

Time Estimate

Our per-task estimate for this project is 1.5-4 hours, plus up to an hour of reading.

---

How to turn in this Project

• Upload your tasks via the Potluck server by the deadline (Tue Oct 29 at 23:00).

  • For listDiagrams, each team member must submit listDiagrams.py.
  • For trainInventory, each team member must submit trainInventory.py.
  • For wordSearch, each team member must submit wordSearch.py.

• Double-check the status of your submitted tasks, since there may be warnings.

• Reminder: you can submit as many times as you like, and only the most recent submission will count for your grade.

• If you run into trouble with the submissions server, contact Peter Mawhorter, and include a copy of the file(s) you were trying to submit.

• Check your score for each task and submit revisions if you need to.

---